Complexity and parameterized algorithms for Cograph Editing
نویسندگان
چکیده
منابع مشابه
Exact and heuristic algorithms for Cograph Editing
We present a dynamic programming algorithm for optimally solving the Cograph Editing problem on an n-vertex graph that runs in O(3n) time and uses O(2) space. In this problem, we are given a graph G = (V,E) and the task is to find a smallest possible set F ⊆ V × V of vertex pairs such that (V,E4F ) is a cograph (or P4-free graph), where 4 represents the symmetric difference operator. We also de...
متن کاملKernelization and Parameterized Complexity of Star Editing and Union Editing
The NP-hard Star Editing problem has as input a graph G = (V, E) with edges colored red and black and two positive integers k1 and k2, and determines whether one can recolor at most k1 black edges to red and at most k2 red edges to black, such that the resulting graph has an induced subgraph whose edge set is exactly the set of black edges. A generalization of Star Editing is Union Editing, whi...
متن کاملGoing Weighted: Parameterized Algorithms for Cluster Editing
The goal of the Cluster Editing problem is to make the fewest changes to the edge set of an input graph such that the resulting graph is a disjoint union of cliques. This problem is NP-complete but recently, several parameterized algorithms have been proposed. In this paper we present a surprisingly simple branching strategy for Cluster Editing. We generalize the problem assuming that edge inse...
متن کاملCS266: Parameterized Algorithms and Complexity
These problems can be solved trivially by trying all subsets of vertices/integers of size k, and checking whether they satisfy the condition in the problem. For k-SUM we get an O(n ·k) time algorithm and for k-CLIQUE we get O(n ·k) whereas for k-DOMINATING-SET we get O(n · n · k). We will show better algorithms for these problems. For k-SUM we’ll get an O(nd k 2 e) time algorithm. For k-CLIQUE ...
متن کاملParameterized Complexity and Approximation Algorithms
. Proc. Ninth Annual ACM-SIAM Symp. Discrete Algorithms, San Francisco, CA, pp. 394–399. ACM, New York.Page 18 of 19D. MARX THE COMPUTER JOURNAL, 2007 [113] Erlebach, T., Jansen, K. and Seidel, E. (2005) Polynomial-timeapproximation schemes for geometric intersection graphs.SIAM J. Comput., 34, 1302–1323. [114] Hochbaum, D.S. and Maass, W. (1985) Approximationschemes for cov...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2012
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2011.11.040